0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.13	% Command    : run_E %s %d THM
0.13/0.34	% Computer : n027.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 960
0.13/0.34	% WCLimit    : 120
0.13/0.34	% DateTime   : Tue Aug  9 04:16:06 EDT 2022
0.13/0.34	% CPUTime    : 
0.19/0.47	Running higher-order on 8 cores theorem proving
0.19/0.47	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.19/0.47	# Version: 3.0pre003-ho
0.19/0.48	# Preprocessing class: HSMSSMSSMLMNHSN.
0.19/0.48	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.19/0.48	# Starting ho_unfolding_3 with 600s (5) cores
0.19/0.48	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.19/0.48	# Starting almost_fo_3_lam with 120s (1) cores
0.19/0.48	# Starting post_as_ho1 with 120s (1) cores
0.19/0.48	# almost_fo_3_lam with pid 30567 completed with status 0
0.19/0.48	# Result found by almost_fo_3_lam
0.19/0.48	# Preprocessing class: HSMSSMSSMLMNHSN.
0.19/0.48	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.19/0.48	# Starting ho_unfolding_3 with 600s (5) cores
0.19/0.48	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.19/0.48	# Starting almost_fo_3_lam with 120s (1) cores
0.19/0.48	# No SInE strategy applied
0.19/0.48	# Search class: HHHNF-FFSF11-SHSSMFNN
0.19/0.48	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.19/0.48	# Starting sh7 with 65s (1) cores
0.19/0.48	# sh7 with pid 30573 completed with status 0
0.19/0.48	# Result found by sh7
0.19/0.48	# Preprocessing class: HSMSSMSSMLMNHSN.
0.19/0.48	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.19/0.48	# Starting ho_unfolding_3 with 600s (5) cores
0.19/0.48	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.19/0.49	# Starting almost_fo_3_lam with 120s (1) cores
0.19/0.49	# No SInE strategy applied
0.19/0.49	# Search class: HHHNF-FFSF11-SHSSMFNN
0.19/0.49	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.19/0.49	# Starting sh7 with 65s (1) cores
0.19/0.49	# Preprocessing time       : 0.001 s
0.19/0.49	# Presaturation interreduction done
0.19/0.49	
0.19/0.49	# Proof found!
0.19/0.49	# SZS status Theorem
0.19/0.49	# SZS output start CNFRefutation
0.19/0.49	thf(decl_22, type, meq_ind: mu > mu > $i > $o).
0.19/0.49	thf(decl_23, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
0.19/0.49	thf(decl_24, type, mnot: ($i > $o) > $i > $o).
0.19/0.49	thf(decl_25, type, mor: ($i > $o) > ($i > $o) > $i > $o).
0.19/0.49	thf(decl_26, type, mand: ($i > $o) > ($i > $o) > $i > $o).
0.19/0.49	thf(decl_27, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
0.19/0.49	thf(decl_28, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
0.19/0.49	thf(decl_29, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
0.19/0.49	thf(decl_30, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
0.19/0.49	thf(decl_31, type, mforall_ind: (mu > $i > $o) > $i > $o).
0.19/0.49	thf(decl_32, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
0.19/0.49	thf(decl_33, type, mexists_ind: (mu > $i > $o) > $i > $o).
0.19/0.49	thf(decl_34, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
0.19/0.49	thf(decl_35, type, mtrue: $i > $o).
0.19/0.49	thf(decl_36, type, mfalse: $i > $o).
0.19/0.49	thf(decl_37, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
0.19/0.49	thf(decl_38, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
0.19/0.49	thf(decl_39, type, mreflexive: ($i > $i > $o) > $o).
0.19/0.49	thf(decl_40, type, msymmetric: ($i > $i > $o) > $o).
0.19/0.49	thf(decl_41, type, mserial: ($i > $i > $o) > $o).
0.19/0.49	thf(decl_42, type, mtransitive: ($i > $i > $o) > $o).
0.19/0.49	thf(decl_43, type, meuclidean: ($i > $i > $o) > $o).
0.19/0.49	thf(decl_44, type, mpartially_functional: ($i > $i > $o) > $o).
0.19/0.49	thf(decl_45, type, mfunctional: ($i > $i > $o) > $o).
0.19/0.49	thf(decl_46, type, mweakly_dense: ($i > $i > $o) > $o).
0.19/0.49	thf(decl_47, type, mweakly_connected: ($i > $i > $o) > $o).
0.19/0.49	thf(decl_48, type, mweakly_directed: ($i > $i > $o) > $o).
0.19/0.49	thf(decl_49, type, mvalid: ($i > $o) > $o).
0.19/0.49	thf(decl_50, type, minvalid: ($i > $o) > $o).
0.19/0.49	thf(decl_51, type, msatisfiable: ($i > $o) > $o).
0.19/0.49	thf(decl_52, type, mcountersatisfiable: ($i > $o) > $o).
0.19/0.49	thf(decl_53, type, rel_m: $i > $i > $o).
0.19/0.49	thf(decl_54, type, mbox_m: ($i > $o) > $i > $o).
0.19/0.49	thf(decl_55, type, mdia_m: ($i > $o) > $i > $o).
0.19/0.49	thf(decl_56, type, p: $i > $o).
0.19/0.49	thf(decl_57, type, q: $i > $o).
0.19/0.49	thf(decl_58, type, r: $i > $o).
0.19/0.49	thf(decl_59, type, esk1_0: $i).
0.19/0.49	thf(decl_60, type, esk2_1: $i > $i).
0.19/0.49	thf(mimplies, axiom, ((mimplies)=(^[X6:$i > $o, X7:$i > $o]:(mor @ (mnot @ X6) @ X7))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mimplies)).
0.19/0.49	thf(mnot, axiom, ((mnot)=(^[X6:$i > $o, X3:$i]:(~((X6 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mnot)).
0.19/0.49	thf(mor, axiom, ((mor)=(^[X6:$i > $o, X7:$i > $o, X3:$i]:(((X6 @ X3)|(X7 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mor)).
0.19/0.49	thf(mdia_m, axiom, ((mdia_m)=(^[X6:$i > $o]:(mnot @ (mbox_m @ (mnot @ X6))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^3.ax', mdia_m)).
0.19/0.49	thf(mbox_m, axiom, ((mbox_m)=(^[X6:$i > $o, X3:$i]:(![X14:$i]:((~((rel_m @ X3 @ X14))|(X6 @ X14)))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^3.ax', mbox_m)).
0.19/0.49	thf(mvalid, axiom, ((mvalid)=(^[X6:$i > $o]:(![X3:$i]:((X6 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mvalid)).
0.19/0.49	thf(mreflexive, axiom, ((mreflexive)=(^[X13:$i > $i > $o]:(![X15:$i]:((X13 @ X15 @ X15))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mreflexive)).
0.19/0.49	thf(prove, conjecture, (mvalid @ (mimplies @ (mbox_m @ (mimplies @ p @ (mdia_m @ (mimplies @ q @ r)))) @ (mdia_m @ (mimplies @ q @ (mimplies @ (mbox_m @ p) @ (mdia_m @ r)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', prove)).
0.19/0.49	thf(a1, axiom, (mreflexive @ rel_m), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^3.ax', a1)).
0.19/0.49	thf(c_0_9, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies])).
0.19/0.49	thf(c_0_10, plain, ((mnot)=(^[Z0:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])).
0.19/0.49	thf(c_0_11, plain, ((mor)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mor])).
0.19/0.49	thf(c_0_12, plain, ((mdia_m)=(^[Z0:$i > $o, Z1:$i]:(~((![X21:$i]:((~((rel_m @ Z1 @ X21))|(~((Z0 @ X21)))))))))), inference(fof_simplification,[status(thm)],[mdia_m])).
0.19/0.49	thf(c_0_13, plain, ((mbox_m)=(^[Z0:$i > $o, Z1:$i]:(![X14:$i]:((~((rel_m @ Z1 @ X14))|(Z0 @ X14)))))), inference(fof_simplification,[status(thm)],[mbox_m])).
0.19/0.49	thf(c_0_14, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_9, c_0_10]), c_0_11])).
0.19/0.49	thf(c_0_15, plain, ((mvalid)=(^[Z0:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])).
0.19/0.49	thf(c_0_16, plain, ((mdia_m)=(^[Z0:$i > $o, Z1:$i]:(~((![X21:$i]:((~((rel_m @ Z1 @ X21))|(~((Z0 @ X21)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12, c_0_10]), c_0_13])).
0.19/0.49	thf(c_0_17, plain, ((mreflexive)=(^[Z0:$i > $i > $o]:(![X15:$i]:((Z0 @ X15 @ X15))))), inference(fof_simplification,[status(thm)],[mreflexive])).
0.19/0.49	thf(c_0_18, negated_conjecture, ~(![X28:$i]:((~(![X24:$i]:((~(rel_m @ X28 @ X24)|(~(p @ X24)|~(![X23:$i]:((~(rel_m @ X24 @ X23)|~((~(q @ X23)|(r @ X23))))))))))|~(![X27:$i]:((~(rel_m @ X28 @ X27)|~((~(q @ X27)|(~(![X25:$i]:((~(rel_m @ X27 @ X25)|(p @ X25))))|~(![X26:$i]:((~(rel_m @ X27 @ X26)|~(r @ X26))))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[prove]), c_0_14]), c_0_15]), c_0_13]), c_0_16])])).
0.19/0.49	thf(c_0_19, plain, ![X22:$i]:((rel_m @ X22 @ X22)), inference(apply_def,[status(thm)],[a1, c_0_17])).
0.19/0.49	thf(c_0_20, negated_conjecture, ![X31:$i, X33:$i, X34:$i, X35:$i]:(((((rel_m @ X31 @ (esk2_1 @ X31))|~(p @ X31)|~(rel_m @ esk1_0 @ X31))&(~(q @ (esk2_1 @ X31))|(r @ (esk2_1 @ X31))|~(p @ X31)|~(rel_m @ esk1_0 @ X31)))&(((q @ X33)|~(rel_m @ esk1_0 @ X33))&((~(rel_m @ X33 @ X34)|(p @ X34)|~(rel_m @ esk1_0 @ X33))&(~(rel_m @ X33 @ X35)|~(r @ X35)|~(rel_m @ esk1_0 @ X33)))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])])).
0.19/0.49	thf(c_0_21, plain, ![X29:$i]:((rel_m @ X29 @ X29)), inference(variable_rename,[status(thm)],[c_0_19])).
0.19/0.49	thf(c_0_22, negated_conjecture, ![X14:$i, X3:$i]:(((p @ X14)|~((rel_m @ X3 @ X14))|~((rel_m @ esk1_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_20])).
0.19/0.49	thf(c_0_23, plain, ![X3:$i]:((rel_m @ X3 @ X3)), inference(split_conjunct,[status(thm)],[c_0_21])).
0.19/0.49	thf(c_0_24, negated_conjecture, ![X3:$i]:(((rel_m @ X3 @ (esk2_1 @ X3))|~((p @ X3))|~((rel_m @ esk1_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_20])).
0.19/0.49	thf(c_0_25, negated_conjecture, ![X3:$i]:(((p @ X3)|~((rel_m @ esk1_0 @ X3)))), inference(spm,[status(thm)],[c_0_22, c_0_23])).
0.19/0.49	thf(c_0_26, negated_conjecture, ((rel_m @ esk1_0 @ (esk2_1 @ esk1_0))|~((p @ esk1_0))), inference(spm,[status(thm)],[c_0_24, c_0_23])).
0.19/0.49	thf(c_0_27, negated_conjecture, (p @ esk1_0), inference(spm,[status(thm)],[c_0_25, c_0_23])).
0.19/0.49	thf(c_0_28, negated_conjecture, ![X14:$i, X3:$i]:((~((rel_m @ X3 @ X14))|~((r @ X14))|~((rel_m @ esk1_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_20])).
0.19/0.49	thf(c_0_29, negated_conjecture, ![X3:$i]:(((q @ X3)|~((rel_m @ esk1_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_20])).
0.19/0.49	thf(c_0_30, negated_conjecture, (rel_m @ esk1_0 @ (esk2_1 @ esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26, c_0_27])])).
0.19/0.49	thf(c_0_31, negated_conjecture, ![X3:$i]:((~((rel_m @ esk1_0 @ X3))|~((r @ X3)))), inference(spm,[status(thm)],[c_0_28, c_0_23])).
0.19/0.49	thf(c_0_32, negated_conjecture, ![X3:$i]:(((r @ (esk2_1 @ X3))|~((q @ (esk2_1 @ X3)))|~((p @ X3))|~((rel_m @ esk1_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_20])).
0.19/0.49	thf(c_0_33, negated_conjecture, (q @ (esk2_1 @ esk1_0)), inference(spm,[status(thm)],[c_0_29, c_0_30])).
0.19/0.49	thf(c_0_34, negated_conjecture, ~((r @ (esk2_1 @ esk1_0))), inference(spm,[status(thm)],[c_0_31, c_0_30])).
0.19/0.49	thf(c_0_35, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_33]), c_0_23]), c_0_27])]), c_0_34]), ['proof']).
0.19/0.49	# SZS output end CNFRefutation
0.19/0.49	# Parsed axioms                        : 73
0.19/0.49	# Removed by relevancy pruning/SinE    : 0
0.19/0.49	# Initial clauses                      : 44
0.19/0.49	# Removed in clause preprocessing      : 38
0.19/0.49	# Initial clauses in saturation        : 6
0.19/0.49	# Processed clauses                    : 23
0.19/0.49	# ...of these trivial                  : 0
0.19/0.49	# ...subsumed                          : 1
0.19/0.49	# ...remaining for further processing  : 22
0.19/0.49	# Other redundant clauses eliminated   : 0
0.19/0.49	# Clauses deleted for lack of memory   : 0
0.19/0.49	# Backward-subsumed                    : 0
0.19/0.49	# Backward-rewritten                   : 1
0.19/0.49	# Generated clauses                    : 14
0.19/0.49	# ...of the previous two non-redundant : 14
0.19/0.49	# ...aggressively subsumed             : 0
0.19/0.49	# Contextual simplify-reflections      : 0
0.19/0.49	# Paramodulations                      : 14
0.19/0.49	# Factorizations                       : 0
0.19/0.49	# NegExts                              : 0
0.19/0.49	# Equation resolutions                 : 0
0.19/0.49	# Propositional unsat checks           : 0
0.19/0.49	#    Propositional check models        : 0
0.19/0.49	#    Propositional check unsatisfiable : 0
0.19/0.49	#    Propositional clauses             : 0
0.19/0.49	#    Propositional clauses after purity: 0
0.19/0.49	#    Propositional unsat core size     : 0
0.19/0.49	#    Propositional preprocessing time  : 0.000
0.19/0.49	#    Propositional encoding time       : 0.000
0.19/0.49	#    Propositional solver time         : 0.000
0.19/0.49	#    Success case prop preproc time    : 0.000
0.19/0.49	#    Success case prop encoding time   : 0.000
0.19/0.49	#    Success case prop solver time     : 0.000
0.19/0.49	# Current number of processed clauses  : 15
0.19/0.49	#    Positive orientable unit clauses  : 5
0.19/0.49	#    Positive unorientable unit clauses: 0
0.19/0.49	#    Negative unit clauses             : 2
0.19/0.49	#    Non-unit-clauses                  : 8
0.19/0.49	# Current number of unprocessed clauses: 3
0.19/0.49	# ...number of literals in the above   : 5
0.19/0.49	# Current number of archived formulas  : 0
0.19/0.49	# Current number of archived clauses   : 7
0.19/0.49	# Clause-clause subsumption calls (NU) : 6
0.19/0.49	# Rec. Clause-clause subsumption calls : 6
0.19/0.49	# Non-unit clause-clause subsumptions  : 0
0.19/0.49	# Unit Clause-clause subsumption calls : 6
0.19/0.49	# Rewrite failures with RHS unbound    : 0
0.19/0.49	# BW rewrite match attempts            : 1
0.19/0.49	# BW rewrite match successes           : 1
0.19/0.49	# Condensation attempts                : 0
0.19/0.49	# Condensation successes               : 0
0.19/0.49	# Termbank termtop insertions          : 2812
0.19/0.49	
0.19/0.49	# -------------------------------------------------
0.19/0.49	# User time                : 0.005 s
0.19/0.49	# System time              : 0.003 s
0.19/0.49	# Total time               : 0.008 s
0.19/0.49	# Maximum resident set size: 1896 pages
0.19/0.49	
0.19/0.49	# -------------------------------------------------
0.19/0.49	# User time                : 0.008 s
0.19/0.49	# System time              : 0.004 s
0.19/0.49	# Total time               : 0.013 s
0.19/0.49	# Maximum resident set size: 1800 pages
0.19/0.49	EOF
